All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3
نویسندگان
چکیده
منابع مشابه
Graphs with 3-rainbow index n-1 and n-2
Let G = (V (G), E(G)) be a nontrivial connected graph of order n with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ N, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color. For a vertex set S ⊆ V (G), a tree connecting S in G is called an S-tree. The minimum number of colors that are needed in an edge-coloring of G such t...
متن کاملDiameter Two Graphs of Minimum Order with Given Degree Set
The degree set of a graph is the set of its degrees. Kapoor et al. [Degree sets for graphs, Fund. Math. 95 (1977) 189-194] proved that for every set of positive integers, there exists a graph of diameter at most two and radius one with that degree set. Furthermore, the minimum order of such a graph is determined. A graph is 2-self- centered if its radius and diameter are two. In this paper for ...
متن کامل3 1 Ja n 20 06 QUANTUM AUTOMORPHISM GROUPS OF VERTEX - TRANSITIVE GRAPHS OF ORDER ≤ 11
We study quantum automorphism groups of vertex-transitive graphs having less than 11 vertices. With one possible exception, these can be obtained from cyclic groups Zn, symmetric groups Sn and quantum symmetric groups Qn, by using various product operations. The exceptional case is that of the Petersen graph, and we present some questions about it.
متن کاملMoore Graphs of Diameter 2 and 3
In [1], the authors prove that for k = 2, there exists unique Moore graphs of type (2, 2), (3, 2) and (7, 2). Moreover, they show that only other possible (d, 2) graph is (57, 2), but could not confirm its existence. For k = 3, the authors show that the only Moore graph is (2, 3) and it is unique. Amazingly, the existence of the (57, 2) graph remains an open problem to this day. To prove these ...
متن کامل$n$-Array Jacobson graphs
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Heliyon
سال: 2020
ISSN: 2405-8440
DOI: 10.1016/j.heliyon.2020.e03694